Stochastic sequential machines with prescribed performance criteria
نویسندگان
چکیده
منابع مشابه
Constrained Sequence Generation Using Stochastic Sequential Machines
In power estimation, one is faced with two problems: 1) generating input vector sequences that satisfy a given statistical behavior (in terms of signal probabilities and correlations among bits); 2) making these sequences as short as possible so as to improve the efficiency of power simulators. Stochastic sequential machines (SSMs) can be used to solve both problems. In particular, this paper p...
متن کاملStochastic Sequential Machines Synthesis with Application to Constrained Sequence Generation
In power estimation, one is faced with two problems: 1) generating input vector sequences that satisfy a given statistical behavior (in terms of signal probabilities and correlations among bits); 2) making these sequences as short as possible so as to improve the efficiency of power simulators. Stochastic sequential machines (SSMs) can be used to solve both problems. In particular, this paper p...
متن کاملPerformance evaluation of the croissant production line with reparable machines
In this study, the analytical probability models for an automated serial production system, bufferless that consists of n-machines in series with common transfer mechanism and control system was developed. Both time to failure and time to repair a failure are assumed to follow exponential distribution. Applying those models, the effect of system parameters on system performance in actu...
متن کاملAsynchronous Sequential Machines with Fault Detectors
A strategy of fault diagnosis and tolerance for asynchronous sequential machines is discussed in this paper. With no synchronizing clock, it is difficult to diagnose an occurrence of permanent or stuck-in faults in the operation of asynchronous machines. In this paper, we present a fault detector comprised of a timer and a set of static functions to determine the occurrence of faults. In order ...
متن کاملMinimal Sequential Interaction Machines
Persistent Turing Machines PTMs are an abstract model for sequential interactive comput ing marrying coinductive semantics with e ective constructibility They are multitape machines with work tape contents preserved between interactions whose behavior is characterized obser vationally by input output streams Notions of PTM equivalence and expressiveness have been studied proving that in non alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1968
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(68)90714-6